-
1 computation graph
вычислительный граф; граф вычислений -
2 computation graph
Большой англо-русский и русско-английский словарь > computation graph
-
3 computation graph
Вычислительная техника: вычислительный граф, граф вычислений -
4 computation graph
вычислительный граф; граф вычисленийEnglish-Russian dictionary of computer science and programming > computation graph
-
5 computation graph
вычислительный граф; граф вычислений -
6 graph
1) график; диаграмма; кривая; номограмма2) граф3) лингв. вариант графемы•- acyclic graph
- alternating graph
- AND-OR graph
- bar graph - bipartite graph
- bunch graph
- Caley graph
- circuit-free graph
- circulant graph
- circular graph
- closed graph
- color graph
- complementary graph
- complete graph
- computation graph
- connected graph
- connectivity graph
- control flow graph
- data flow program graph
- data-flow graph - directed graph
- E-graph
- extremal graph
- finite graph
- flat graph
- flow graph
- game graph
- harward graph
- indirected graph
- infinite graph
- information graph
- irregular graph
- labeled graph
- line graph
- linear graph
- locally finite graph
- marked points graph
- monochromatic graph
- multidimensional graph
- N-chromatic graph
- network graph
- net graph
- node-symmetric graph
- object graph
- ordered graph
- oriented graph
- pattern graph
- planar graph
- processing graph
- product graph
- regular graph of degree N
- regular graph
- scene graph
- section graph
- signal-flow graph
- singular graph
- software graph
- spectral decision graph
- stacked bar graph
- stacked graph
- state graph
- strongly connected graph
- task graph
- total graph
- transaction graph
- transition graph
- tree graph
- two-dimensional graph
- undirected graph
- vertex-weighted graph
- weighted directed graph
- word graphEnglish-Russian dictionary of computer science and programming > graph
-
7 computation
1. n исчисление2. n вычисление; подсчёт, расчёт; выкладка3. n смета4. n вычислительная техникаcomputation graph — вычислительный граф; граф вычислений
Синонимический ряд:1. calculation (noun) calculation; ciphering; estimation; figuring; gauge; numeration; reckoning2. numbers (noun) arithmetic; figures; numbers3. total (noun) estimate; figure; result; sum; total -
8 graph
1. n график, диаграмма, номограмма; криваяcomputation graph — вычислительный граф; граф вычислений
2. n мат. лингв. графgraph features — свойства графа; теоретико-графовые свойства
product graph — произведение графов; граф-произведение
singular graph — сингулярный граф; вырожденный граф
3. v изображать диаграммой; чертить графики4. v разг. размножать, копировать с помощью гектографаСинонимический ряд:1. chart (noun) bar chart; blueprint; chart; design; diagram; flow chart; linear representation; map; picture; pie chart; plot; table2. diagram (verb) diagram; draw; outline; trace -
9 graph
1. график2. диаграмма; графикcomputation graph — вычислительный граф; граф вычислений
3. чертить графикsingular graph — сингулярный граф; вырожденный граф
regular graph — однородный граф; регулярный граф
-
10 graph
1. график, диаграммаcomputation graph — вычислительный граф; граф вычислений
2. графgraph features — свойства графа; теоретико-графовые свойства
product graph — произведение графов; граф-произведение
singular graph — сингулярный граф; вырожденный граф
3. гидрограф -
11 computation
address computation — формирование адреса; вычисление адреса
computation graph — вычислительный граф; граф вычислений
-
12 computation
расчёт; вычислениеaddress computation — формирование адреса; вычисление адреса
computation graph — вычислительный граф; граф вычислений
-
13 computation
вычисление; расчёт; счёт, подсчёт- analog computation
- array computation
- cellular computations
- cognitive computations
- compile time computation
- computation of motion
- control computation
- digital computation
- double-precision computation
- fine grained computation
- fine-grain computation
- fixed-point computation
- generate-and-test computations
- graph computations
- hand computation
- hybrid computation
- implicit computation
- incremental computation
- local computation
- low-bandwidth computations
- machine computation
- manual computation
- mixed computations
- multiple computations
- neural computation
- N-fold computations
- nonnumeric computation
- numerical computation
- pervasive computation
- real-time computation
- recursive computation
- redundant computation
- sequential computation
- signal-precision computation
- step-by-step computation
- structural computation
- symbolic computation
- wavefront computationsEnglish-Russian dictionary of computer science and programming > computation
-
14 machine computation
1. вычисление с помощью машины; машинное вычислениеaddress computation — формирование адреса; вычисление адреса
computation graph — вычислительный граф; граф вычислений
2. машинное вычисление -
15 nonnumeric computation
1. нечисленный расчет; нецифровые вычисленияaddress computation — формирование адреса; вычисление адреса
2. нецифровые вычисленияcomputation graph — вычислительный граф; граф вычислений
-
16 compile time computation
address computation — формирование адреса; вычисление адреса
computation graph — вычислительный граф; граф вычислений
-
17 redundant computation
address computation — формирование адреса; вычисление адреса
computation graph — вычислительный граф; граф вычислений
-
18 sequential computation
address computation — формирование адреса; вычисление адреса
computation graph — вычислительный граф; граф вычислений
-
19 atomic computation
computation graph — вычислительный граф; граф вычислений
English-Russian big polytechnic dictionary > atomic computation
-
20 digital computation
address computation — формирование адреса; вычисление адреса
computation graph — вычислительный граф; граф вычислений
English-Russian big polytechnic dictionary > digital computation
См. также в других словарях:
Graph transformation — Graph transformation, or Graph rewriting, concerns the technique to create a new graph out of an original graph using some automatic machine. It has numerous applications, ranging from software verification to layout algorithms.Graph… … Wikipedia
Graph coloring — A proper vertex coloring of the Petersen graph with 3 colors, the minimum number possible. In graph theory, graph coloring is a special case of graph labeling; it is an assignment of labels traditionally called colors to elements of a graph… … Wikipedia
Configuration graph — Configuration graphs are a theoretical tool used in computational complexity theory to prove a relation between graph reachability and complexity classes. Contents 1 Definition 2 Useful property 3 Use of this object … Wikipedia
Connected component (graph theory) — A graph with three connected components. In graph theory, a connected component of an undirected graph is a subgraph in which any two vertices are connected to each other by paths, and which is connected to no additional vertices. For example,… … Wikipedia
Degeneracy (graph theory) — In graph theory, a k degenerate graph is an undirected graph in which every subgraph has a vertex of degree at most k: that is, some vertex in the subgraph touches k or fewer of the subgraph s edges. The degeneracy of a graph is the smallest… … Wikipedia
Power graph analysis — In computational biology, power graph analysis is a method for the analysis andrepresentation of complex networks. Power graph analysis is the computation, analysis and visual representation of a power graph from a graphs (networks).Power graph… … Wikipedia
Feynman graph — A Feynman graph is a graph suitable to be a Feynman diagram in a particular application of quantum field theory. (The most common use is when each field has quanta (particles) associated with it as the quantum of the electromagnetic field is a… … Wikipedia
Bond graph — A bond graph is a graphical description of a physical dynamic system. It is an energy based graphical technique for building mathematical models of dynamic systems. A bond graph depicts the energy flow between components used to model a system.… … Wikipedia
Aperiodic graph — In the mathematical area of graph theory, a directed graph is said to be aperiodic if there is no integer k > 1 that divides the length of every cycle of the graph. Equivalently, a graph is aperiodic if the greatest common divisor of the lengths… … Wikipedia
Periodic graph (crystallography) — For other uses, see Periodic graph. A (large) unit cell of Diamond crystal net; the balls represent carbon atoms and the sticks represent covalent bonds … Wikipedia
Chronology of computation of π — The table below is a brief chronology of computed numerical values of, or bounds on, the mathematical constant pi (π). See the history of numerical approximations of pi for explanations, comments and details concerning some of the calculations… … Wikipedia